Min-cut program decomposition for thread-level speculation
نویسندگان
چکیده
منابع مشابه
Min-cut-based Program Decomposition for Thread-level Speculation
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix
متن کاملThread-Level Speculation for Web Applications
Thread Level Speculation (TLS) has been suggested as a mean to automatically (or semi-automatically) extract parallelism from sequential programs. While there have been multiple attempts both in hardware and software to implement real time TLS, to the best of our knowledge all attempts have so far been on a byte code level or with statically typed languages. In this study, we examine the potent...
متن کاملArchitectural Support for Thread-level Data Speculation
Thread-Level Data Speculation (TLDS) is a technique which enables the optimistic parallelization of applications despite uncertainty as to whether data dependences exist between the resulting threads which would normally make them unsafe to execute in parallel. The basic idea is to speculate that dependences do not exist, and to then recover and restart whenever dependences do occur dynamically...
متن کاملImproving Value Communication for Thread-Level Speculation
Thread-Level Speculation (TLS) allows us to automatically parallelize general-purpose programs by supporting parallel execution of threads that might not actually be independent. In this paper, we show that the key to good performance lies in the three different ways to communicate a value between speculative threads: speculation, synchronization, and prediction. The difficult part is deciding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2004
ISSN: 0362-1340,1558-1160
DOI: 10.1145/996893.996851